Static Verification of Task Access to Shared Resources in Real-Time Systems
نویسندگان
چکیده
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملRobust Partitioned Scheduling for Static-Priority Real-Time Multiprocessor Systems with Shared Resources
We focus on the partitioned scheduling of sporadic real-time tasks with constrained deadlines. The scheduling policy on each processor is staticpriority. The considered tasks are not independent and the consistency of these shared data is ensured by a multiprocessor synchronization protocol. Considering these assumptions, we propose a partitioned scheduling algorithm which tends to maximize the...
متن کاملRequirements for Static Task Scheduling in Real Time Embedded Systems
Static task scheduling is an important step in embedded system design. In this paper, we have studied a recently proposed representation model, called Multi Thread Graph and a given static scheduling heuristic based on this MTG. Applying the heuristic to the software part of a GPS receiver, we have successfully scheduled the tasks under the required timing constraints. The experiment shows that...
متن کاملCommunicating Shared Resources: A Model for Distributed Real-Time Systems
The timing behavior of a real-time system depends not only on delays due to process synchronization, but also on resource requirements and scheduling. However, most real-time models have abstracted out resourcespecific details, and thus assume operating environments such as maximum parallelism or pure interleaving. This paper presents a real-time formalism called Communicating Shared Resources ...
متن کاملPartitioning Real-Time Systems on Multiprocessors with Shared Resources
In this paper we propose a blocking-aware partitioning algorithm which allocates a task set on a multiprocessor (multi-core) platform in a way that the overall amount of blocking times of tasks are decreased. The algorithm reduces the total utilization which, in turn, has the potential to decrease the total number of required processors (cores). In this paper we evaluate our algorithm and compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SPIIRAS Proceedings
سال: 2017
ISSN: 2078-9599,2078-9181
DOI: 10.15622/sp.52.7